Approximation algorithms on consistent dynamic map labeling

Approximation Algorithms on Consistent Dynamic Map Labeling

We consider the dynamic map labeling problem: given a set of rectangular labels on the map, the goal is to appropriately select visible ranges for all the labels such that no two consistent labels overlap at every scale and the sum of total visible ranges is maximized. We propose approximation algorithms for several variants of this problem. For the simple ARO problem, we provide a 3c log n-app...

Genetic algorithms for map labeling

Trajectory-Based Dynamic Map Labeling

In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling model and study the active range maximization problem in this model. The problem isNP-complete andW[1]-hard. In the restricted, yet practically relevant case that no more than k labels can be active at any time, we g...

Consistent-Labeling Problems and Their Algorithms

Two new classes of theories have been developed giving the expected complexities of three ConsistentLabeling Problem (CLP), or Constraint-Satisfaction, algorithms: Backtracking, Forward Checking and Word-wise Forward Checking. Apart from giving the exact expected complexity for these algorithms for the underlying CLP distribution and domain, these theories provide useful approximations for the ...

Supporting Dynamic Labeling in Web Map Applications

Web mapping based on client-side application programming interfaces (APIs) is very popular, especially for mashups. However, we can observe that most of these applications use no labeling. Thus, fast comprehensibility of such maps is hindered. In this paper, we investigate the reasons for this situation. Based on this analysis, a specification is presented that fosters the use of dynamic point ...